Off-diagonal symmetric nonnegative matrix factorization

نویسندگان

چکیده

Symmetric nonnegative matrix factorization (symNMF) is a variant of (NMF) that allows handling symmetric input matrices and has been shown to be particularly well suited for clustering tasks. In this paper, we present new model, dubbed off-diagonal symNMF (ODsymNMF), does not take into account the diagonal entries in objective function. ODsymNMF three key advantages compared symNMF. First, theoretically much more sound as there always exists an exact size at most n(n − 1)/2 where n dimension matrix. Second, it makes sense practice typically correspond similarity between item itself, bringing information. Third, optimization problem easier solve. particular, will allow us design algorithm based on coordinate descent minimizes component-wise ℓ1 norm its approximation. We prove better binary often encountered practice. also derive method ℓ2 norm, compare two approaches with synthetic document datasets.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Symmetric Nonnegative Matrix Factorization for Graph Clustering

Nonnegative matrix factorization (NMF) provides a lower rank approximation of a nonnegative matrix, and has been successfully used as a clustering method. In this paper, we offer some conceptual understanding for the capabilities and shortcomings of NMF as a clustering method. Then, we propose Symmetric NMF (SymNMF) as a general framework for graph clustering, which inherits the advantages of N...

متن کامل

On Reduced Rank Nonnegative Matrix Factorization for Symmetric Nonnegative Matrices

Let V ∈ R be a nonnegative matrix. The nonnegative matrix factorization (NNMF) problem consists of finding nonnegative matrix factors W ∈ R and H ∈ R such that V ≈ WH. Lee and Seung proposed two algorithms which find nonnegative W and H such that ‖V −WH‖F is minimized. After examining the case in which r = 1 about which a complete characterization of the solution is possible, we consider the ca...

متن کامل

Hierarchical community detection via rank-2 symmetric nonnegative matrix factorization

Background Community discovery is an important task for revealing structures in large networks. The massive size of contemporary social networks poses a tremendous challenge to the scalability of traditional graph clustering algorithms and the evaluation of discovered communities. Methods We propose a divide-and-conquer strategy to discover hierarchical community structure, nonoverlapping wit...

متن کامل

A Stochastic Nonconvex Splitting Method for Symmetric Nonnegative Matrix Factorization

where (a) because that E and Tr are both linear operators and Tr[E[ZZ ]] is certain positive number which is independent on the optimization variables, then this term can be replaced by another positive constant Tr[EZ[Z ]EZ[Z]]. Based on the equivalence between (13) and (14), we can apply the result shown in [28, Lemma 2]. Since the constraint set is polyhedral in the formulation (3), the linea...

متن کامل

Fast and Effective Algorithms for Symmetric Nonnegative Matrix Factorization

Symmetric Nonnegative Matrix Factorization (SNMF) models arise naturally as simple reformulations of many standard clustering algorithms including the popular spectral clustering method. Recent work has demonstrated that an elementary instance of SNMF provides superior clustering quality compared to many classic clustering algorithms on a variety of synthetic and real world data sets. In this w...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Numerical Algorithms

سال: 2021

ISSN: ['1017-1398', '1572-9265']

DOI: https://doi.org/10.1007/s11075-020-01063-9